The multi-budgeted and weighted bounded degree metric Steiner network problem
نویسندگان
چکیده
منابع مشابه
Online Degree-Bounded Steiner Network
The problem of satisfying connectivity demands on a graph while respecting given constraints has been a pillar of the area of network design since the early seventies [45, 14, 13, 12, 41]. The problem of degree-bounded spanning tree, introduced in Garey and Johnson’s Black Book of NP-Completeness [37], was first investigated in the pioneering work of Fürer and Raghavachari [17] (Allerton’90). I...
متن کاملOnline Degree-Bounded Steiner Network Design
We initiate the study of degree-bounded network design problems in the online setting. The degree-bounded Steiner tree problem – which asks for a subgraph with minimum degree that connects a given set of vertices – is perhaps one of the most representative problems in this class. This paper deals with its well-studied generalization called the degree-bounded Steiner forest problem where the con...
متن کاملImproved Approximation Algorithms for (Budgeted) Node-Weighted Steiner Problems
Moss and Rabani [13] study constrained node-weighted Steiner tree problems with two independent weight values associated with each node, namely, cost and prize (or penalty). They give an O(logn)-approximation algorithm for the prize-collecting node-weighted Steiner tree problem (PCST)—where the goal is to minimize the cost of a tree plus the penalty of vertices not covered by the tree. They use...
متن کاملThe Budgeted Multi-armed Bandit Problem
The following coins problem is a version of a multi-armed bandit problem where one has to select from among a set of objects, say classifiers, after an experimentation phase that is constrained by a time or cost budget. The question is how to spend the budget. The problem involves pure exploration only, differentiating it from typical multi-armed bandit problems involving an exploration/exploit...
متن کاملOnline Weighted Degree-Bounded Steiner Networks via Novel Online Mixed Packing/Covering
We design the first online algorithm with poly-logarithmic competitive ratio for the edge-weighted degree-bounded Steiner forest (EW-DB-SF) problem and its generalized variant. We obtain our result by demonstrating a new generic approach for solving mixed packing/covering integer programs in the online paradigm. In EW-DB-SF, we are given an edge-weighted graph with a degree bound for every vert...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Parallel and Distributed Computing
سال: 2017
ISSN: 0743-7315
DOI: 10.1016/j.jpdc.2016.12.001